On the optimality conditions of vector-valued n-set functions
نویسندگان
چکیده
منابع مشابه
Optimality Conditions for Vector Optimization with Set-Valued Maps
In this paper, we establish a Farkas-Minkowski type alternative theorem under the supposition of nearly semiconvexlike set-valued maps. Based on the alternative theorem and some other lemmas, we present necessary optimality conditions and sufficient optimality conditions for set-valued vector optimization problems with extended inequality constraints in a sense of weak E-minimizers.
متن کاملOptimality Conditions for Vector Optimisation with Set-valued Maps
In recent years, vector optimisation with set-valued maps in infinite dimensional spaces has been received an increasing amount of attention. See [6, 2, 5, 8, 4, 9] and references therein, for its extensive applications in many fields such as mathematical programming, optimal control, management science. Vector optimisation with setvalued maps, sometimes called set-valued vector optimisation fo...
متن کاملOptimality Conditions for Maximizations of Set-Valued Functions
The maximization with respect to a cone of a set-valued function into possibly infinite dimensions is defined, and necessary and sufficient optimality conditions are established. In particular, an analogue of the Fritz John necessary optimality conditions is proved using a notion of derivative defined in terms of tangent cones.
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملOn -optimality Conditions for Convex Set-valued Optimization Problems
In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1991
ISSN: 0022-247X
DOI: 10.1016/0022-247x(91)90337-y